Commutative, idempotent groupoids and the constraint satisfaction problem
نویسنده
چکیده
A restatement of the Algebraic Dichotomy Conjecture, due to Maroti and McKenzie, postulates that if a finite algebra A possesses a weak near-unanimity term, then the corresponding constraint satisfaction problem is tractable. A binary operation is weak near-unanimity if and only if it is both commutative and idempotent. Thus if the dichotomy conjecture is true, any finite commutative, idempotent groupoid (CI groupoid) will be tractable. It is known that every semilattice (i.e., an associative CI groupoid) is tractable. A groupoid identity is of Bol-Moufang type if the same three variables appear on either side, one of the variables is repeated, the remaining two variables appear once, and the variables appear in the same order on either side (for example, x(x(yz)) ≈ (x(xy))z). These identities can be thought of as generalizations of associativity. We show that there are exactly 8 varieties of CI groupoids defined by a single additional identity of Bol-Moufang type, derive some of their important structural properties, and use that structure theory to show that 7 of the varieties are tractable. We also characterize the finite members of the variety of CI groupoids satisfying the self-distributive law x(yz) ≈ (xy)(xz), and show that they are tractable.
منابع مشابه
Some regular quasivarieties of commutative binary modes
Irregular (quasi)varieties of groupoids are (quasi)varieties that do not contain semilattices. The regularization of a (strongly) irregular variety V of groupoids is the smallest variety containing V and the variety S of semilattices. Its quasiregularization is the smallest quasivariety containing V and S. In an earlier paper the authors described the lattice of quasivarieties of cancellative c...
متن کاملUniversal Algebraic Methods for Constraint Satisfaction Problems
After substantial progress over the last 15 years, the “algebraic CSPdichotomy conjecture” reduces to the following: every local constraint satisfaction problem (CSP) associated with a finite idempotent algebra is tractable if and only if the algebra has a Taylor term operation. Despite the tremendous achievements in this area, there remain examples of small algebras with just a single binary o...
متن کاملk-Hyperarc Consistency for Soft Constraints over Divisible Residuated Lattices
We investigate the applicability of divisible residuated lattices (DRLs) as a general evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs are in fact natural candidates for this role, since they form the algebraic semantics of a large family of substructural and fuzzy logics [GJKO07, Háj98]. We present the following results. (i) We show that DRLs subsume important v...
متن کاملSoft Constraints Processing over Divisible Residuated Lattices
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semantics of a large family of substructural and fuzzy logics [13, 15], and are therefore natural candidates for this role. As a preliminary evidence in support to our claim, along the lines of Cooper et al. and Larrosa et a...
متن کاملOn absorption in semigroups and n-ary semigroups
The notion of absorption was developed a few years ago by Barto and Kozik and immediately found many applications, particularly in topics related to the constraint satisfaction problem. We investigate the behavior of absorption in semigroups and n-ary semigroups (that is, algebras with one n-ary associative operation). In the case of semigroups, we give a simple necessary and sufficient conditi...
متن کامل